On Some City Guarding Problems
نویسندگان
چکیده
We consider guarding a city of k vertical buildings, each having a rectangular base, by placing guards only at vertices. The aim is to use the smallest number of guards. The problem is a 2.5D variant of the traditional art gallery problem, and finds applications in urban security. We give upper and lower bounds on the number of guards needed for a few versions of the problem. Specifically, we prove that 2(k−1) 3 + 1 guards are always sufficient and sometimes necessary to guard all roofs, and 1 + k + k2 guards are always sufficient to guard the roofs, walls, and the ground, while each roof has at least one guard on it.
منابع مشابه
Survey of Terrain Guarding and Art Gallery Problems
The terrain guarding problem and art gallery problem are two areas in computational geometry. Different versions of terrain guarding involve guarding a discrete set of points or a continuous set of points on a terrain. The art gallery problem has versions including guarding an entire polygon by a set of discrete points at the vertices or any point inside the polygon itself. This paper will give...
متن کاملApproximation algorithms for terrain guarding
We present approximation algorithms and heuristics for several variations of terrain guarding problems, where we need to guard a terrain in its entirety by a minimum number of guards. Terrain guarding has applications in telecommunications, namely in the setting up of antenna networks for wireless communication. Our approximation algorithms transform the terrain guarding instance into a MINIMUM...
متن کاملOptimal guarding of polygons and monotone chains
In this paper we study several problems concerning the guarding of a polygon or a x-monotone polygonal chain P with n vertices from a set of points lying on it. Our results are: (1) An O(n logn) time sequential algorithm for computing the shortest guarding boundary chain of a polygon P. (2) An O(n logn) time sequential algorithm for computing the smallest set of consecutive edges guarding a pol...
متن کاملDivergence in male mating tactics between two populations of the soapberry bug: I. Guarding versus nonguarding
Scott P. Carroll Department of Biology, University of Utah, Salt Lake City, UT 84112, USA I compared male allocation to prolonged mate guarding versus not guarding between two populations of the soapberry bug {fadera haematoloma) that differ in adult sex ratio: Oklahoma, USA (mean ± SD adult sex ratio, 2.70 ± 0.95 males per female), and Florida, USA (1.09 ± 0.26 males per female). To predict th...
متن کاملExact Algorithms for Terrain Guarding
Given a 1.5-dimensional terrain T , also known as an x-monotone polygonal chain, the Terrain Guarding problem seeks a set of points of minimum size on T that guards all of the points on T . Here, we say that a point p guards a point q if no point of the line segment pq is strictly below T . The Terrain Guarding problem has been extensively studied for over 20 years. In 2005 it was already estab...
متن کامل